Measurable versions of Vizing's theorem

Measurable Utility and the Measurable Choice Theorem

The Measurable Kesten Theorem

We give an explicit bound on the spectral radius in terms of the densities of short cycles in finite d-regular graphs. It follows that the a finite d-regular Ramanujan graph G contains a negligible number of cycles of size less than c log log |G|. We prove that infinite d-regular Ramanujan unimodular random graphs are trees. Through Benjamini-Schramm convergence this leads to the following rigi...

Brooks’s Theorem for Measurable Colorings

Throughout, by a graph we mean a simple undirected graph, where the degree of a vertex is its number of neighbors, and a d-coloring is a function assigning each vertex one of d colors so that adjacent vertices are mapped to different colors. This paper examines measurable analogues of Brooks’s Theorem. While a straightforward compactness argument extends Brooks’s Theorem to infinite graphs, suc...

Symmetric Versions of Laman's Theorem

Recent work has shown that if an isostatic bar and joint framework possesses non-trivial symmetries, then it must satisfy some very simply stated restrictions on the number of joints and bars that are ‘fixed’ by various symmetry operations of the framework. For the group C3 which describes 3-fold rotational symmetry in the plane, we verify the conjecture proposed in [4] that these restrictions ...

FUZZY QUASI-METRIC VERSIONS OF A THEOREM OF GREGORI AND SAPENA

We provide fuzzy quasi-metric versions of a fixed point theorem ofGregori and Sapena for fuzzy contractive mappings in G-complete fuzzy metricspaces and apply the results to obtain fixed points for contractive mappingsin the domain of words.